منابع مشابه
Infinite Saturated Orders
We generalize the notion of saturated orders to infinite partial orders and give both a set-theoretic and an algebraic characterization of such orders. We then study the proof theoretic strength of the equivalence of these characterizations in the context of reverse mathematics, showing that depending on one’s choice of definitions, this equivalence is either provable in RCA0 or equivalent to A...
متن کاملAtoms and partial orders of infinite languages
We determine minimal elements, i.e., atoms, in certain partial orders of factor closed languages under ⊆. This is in analogy to structural Ramsey theory which determines minimal structures in partial orders under embedding. Mathematics Subject Classification. 68R15, 05C55.
متن کاملNormal Tree Orders for Infinite Graphs
A well-founded tree T denned on the vertex set of a graph G is called normal if the endvertices of any edge of G are comparable in T. We study how normal trees can be used to describe the structure of infinite graphs. In particular, we extend Jung's classical existence theorem for trees of height w to trees of arbitrary height. Applications include a structure theorem for graphs without large c...
متن کاملBetter Orders for Saturated Cost Partitioning in Optimal Classical Planning
Cost partitioning is a general method for adding multiple heuristic values admissibly. In the setting of optimal classical planning, saturated cost partitioning has recently been shown to be the cost partitioning algorithm of choice for pattern database heuristics found by hill climbing, systematic pattern database heuristics and Cartesian abstraction heuristics. To evaluate the synergy of the ...
متن کاملOn Expressive Power of Regular Expressions over Infinite Orders
Two fundamental results of classical automata theory are the Kleene theorem and the Büchi-Elgot-Trakhtenbrot theorem. Kleene’s theorem states that a language of finite words is definable by a regular expression iff it is accepted by a finite state automaton. Büchi-ElgotTrakhtenbrot’s theorem states that a language of finite words is accepted by a finite-state automaton iff it is definable in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Order
سال: 2010
ISSN: 0167-8094,1572-9273
DOI: 10.1007/s11083-010-9160-6